A Framework for Generating Group-Parallel Programs

نویسندگان

  • URSULA FISSGUS
  • THOMAS RAUBER
  • GUDULA RÜNGER
چکیده

We consider the generation of mixed task and data parallel programs and discuss how a clear separation of task and data parallelism can support the development of efficient programs. The separation between the two levels is preserved during the design and translation phases while allowing specific information to flow between the two levels. Thus, the model is able to combine well-known results in the detection of data parallelism with the design of task parallelism for a specific application. We show how parallel program parts can be generated from a data-parallel and a task-parallel specification and how the interaction between the two levels can be established.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Parallel Program Generation and Optimization from Data Decompositions

Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel programs based on a separately specified decomposition of the data. To this purpose, programs and data decompositions are expressed in a calculus, called Vcal. It is shown that by rewriting calculus expressions, Singl...

متن کامل

Parallel computation framework for optimizing trailer routes in bulk transportation

We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...

متن کامل

Mts: a Light Framework for Parallelizing Tree Search Codes

We describe version 0.1 of mts, a generic framework for parallelizing certain types of tree search programs using a single common wrapper. This complements a previous tutorial that focused on using a preliminary version of mts. mts supports sharing information between processes which is important for applications such as satisfiability testing and branch-and-bound. No parallelization is impleme...

متن کامل

Compiling for massively parallel architectures: a perspective

The problem of automatically generating programs for massively parallel computers is a very complicated one, mainly because there are many architectures, each of them seeming to pose its own particular compilation problem. The purpose of this paper is to propose a framework in which to discuss the compilation process, and to show that the features which aaect it are few and generate a small num...

متن کامل

A Framework for Generating Task Parallel Programs

We consider the generation of mixed task and data parallel programs and discuss how a clear separation into a task and data parallel level can support the development of eecient programs. The program development starts with a speciication of the maximum degree of task and data parallelism and proceeds by performing several derivation steps in which the degree of parallelism is adapted to a spec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998